fibonacci heap造句

例句与造句

1. It is unknown whether the strict Fibonacci heap is efficient in practice.
2. Notably, Fibonacci heap or Brodal queue offer optimal implementations for those 3 operations.
3. The potential of a Fibonacci heap is given by
4. For instance, Fibonacci heaps can be merged in O ( 1 ) time.
5. Alternatively, a Fibonacci heap can perform the same decrease-priority operations in constant amortized time.
6. It's difficult to find fibonacci heap in a sentence. 用fibonacci heap造句挺难的
7. They named Fibonacci heaps after the Fibonacci numbers, which are used in their running time analysis.
8. For this reason Fibonacci heaps and other amortized data structures may not be appropriate for real-time systems.
9. Additionally, it helps explain the time analysis of some operations in the binomial heap and Fibonacci heap data structures.
10. Variants of the basic heap data structure such as pairing heaps or Fibonacci heaps can provide better bounds for some operations.
11. A Leonardo heap resembles a Fibonacci heap in that it is made up of a collection of heap-ordered Leonardo trees.
12. It is possible to create a data structure which has the same worst-case performance as the Fibonacci heap has amortized performance.
13. The run-relaxed heaps of Driscoll et al . give good worst-case performance for all Fibonacci heap operations except merge.
14. Similarly, the priority queue may be a binary heap or any other logarithmic-time priority queue; more sophisticated priority queues such as a Fibonacci heap are not necessary.
15. Applications of Fibonacci numbers include computer algorithms such as the Fibonacci search technique and the Fibonacci heap data structure, and graphs called Fibonacci cubes used for interconnecting parallel and distributed systems.
16. A Fibonacci heap is thus better than a binary or binomial heap when " b " is smaller than " a " by a non-constant factor.
更多例句：  下一页